Geographic Routing with Low Stretch in d - dimensional Spaces ∗
نویسنده
چکیده
Geographic routing is attractive because the routing state needed per node is independent of network size. We present a novel geographic routing protocol with several major advances over previous geographic protocols. First, our protocol achieves an average routing stretch close to 1. Second, our protocol can be used for nodes located in d-dimensional Euclidean spaces (d ≥ 2). Third, node locations are specified by coordinates which may be accurate, inaccurate, or arbitrary. Conceptually, our routing structure consists of a Delaunay triangulation (DT) overlay on an arbitrary connectivity graph. We refer to the structure as a multi-hop DT. Greedy routing in a correct multi-hop DT provides guaranteed delivery. We present join, leave, failure, maintenance, and initialization protocols, named MDT protocols, for constructing and maintaining a multi-hop DT using soft states. The join protocol is proved to be correct for serial joins. When a system is under churn, nodes may join, leave, and fail concurrently. Our experiments show that MDT’s routing success rate is close to 100% for systems under churn and node states converge to a correct multi-hop DT after churn. MDT is scalable to large networks. We present performance comparisons of MDT versus several geographic (and one nongeographic) routing protocols for nodes in 2D and 3D.
منابع مشابه
Greedy Embeddings, Trees, and Euclidean vs. Lobachevsky Geometry
A greedy embedding of an unweighted undirected graph G = (V, E) into a metric space (X, ρ) is a function f : V → X such that for every source-sink pair of different vertices s, t ∈ V it is the case that s has a neighbor v in G with ρ(f(v), f(t)) < ρ(f(s), f(t)). Finding greedy embeddings of connectivity graphs helps to build distributed routing schemes with compact routing tables. In this paper...
متن کاملAn Experimental Study of Low Stretch Factor on Greedy Geometric routing based Algorithm
Greedy routing has drawn a lot of attention in research community. To our best knowledge, stretch factor has not been studied for greedy routing algorithms. In this paper, we propose a new greedy routing algorithm and take the initiative to evaluate its stretch factor. Our algorithm generalizes the algorithm presented in [1]. It embeds an n-vertex connected graph G(V,E) in a semi-metric space. ...
متن کاملGOAL: A parsimonious geographic routing protocol for large scale sensor networks
Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, due to the local minimum caused by holes/obstacles, the path stretch of geographic routing may degrade up to O(c2), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a c...
متن کاملG-STAR: Geometric STAteless Routing for 3-D wireless sensor networks
3-D aerial and underwater sensor networks have found various applications in natural habitat monitoring, weather/earthquake forecast, terrorist intrusion detection, and homeland security. The resource-constrained and dynamic nature of such networks has made the stateless routing protocol with only local information a preferable choice. However, most of the existing routing protocols require sen...
متن کاملA position-based routing algorithm in 3D sensor networks
As large-scale sensor networks become more feasible, properties such as stateless nature and low maintenance overhead make postion based routing increasingly more attractive. Motivated by the fact that sensor networks would probably be deployed in a three dimensional space, we present a novel 3D geographical routing algorithm (3DGR) that makes use of the position information to route packets fr...
متن کامل